Efficient Distributed Search for Multicast Session Keywords
نویسندگان
چکیده
mDNS is a proposed DNS-aware, hierarchical, and scalable multicast session directory architecture that enables multicast session registration and makes them discoverable in real time. It supports domain-specific as well as global searches for candidate sessions. This paper improves mDNS global search algorithm and addresses various security and scalability concerns that remained in mDNS. We propose distributing the overall keyword space among designated MSD servers using hash values. In contrast to other P2P keyword search approaches, we propose IP style prefix routing on the keyword hashes to locate the appropriate MSD server in order to register or retrieve any globally-scoped multicast session. This supports efficient and fast distributed keyword search.
منابع مشابه
Route optimization of multicast sessions in sparse light-splitting optical networks
In this paper, we investigate the multicast routing problem in sparse splitting networks (MR-SSN). The MRSSN problem is to find a route from the source node of a session to all destinations of the session such that the total number fibers used in establishing the session is minimized while the multicast capable nodes are evenly distributed throughout the network. We present a heuristic based on...
متن کاملComputationally effecient group re-keying for time sensitive applications
Key distribution is an important problem for secure group communications. Multicast is an efficient means of distributing data in terms of resources usage. All the designated receivers or members in a multicast group share a session key. Session keys shall change dynamically to ensure both forward secrecy and backward secrecy of multicast sessions. The communication and storage complexity of mu...
متن کاملDistributed delay constrained multicast routing algorithm with efficient fault recovery
Existing distributed delay constrained multicast routing algorithms construct a multicast tree in a sequential fashion and need to be restarted when failures occur during the multicast tree construction phase or during an on-going multicast session. This article proposes an efficient distributed delay constrained multicast routing algorithm that constructs a multicast tree in a concurrent fashi...
متن کاملA Novel Approach for Secured Symmetric Key Distribution in Dynamic Multicast Networks
–Multicasting is an efficient means of distributing data in terms of resources usage. All the designated receivers or members in a multicast group share a session key. Session keys shall change dynamically to ensure both forward secrecy and backward secrecy of multicast sessions. The communication and storage complexity of multicast key distribution problem has been studied extensively. We impl...
متن کاملReliable Broadcast and Multicast in context of partitioning
We present two protocols, a distributed reliable broadcast and a distributed reliable multicast; these protocols are resistant to network partitions in asynchronous distributed systems. They are reliable in the sense that the receiver will eventually receive the message even if the receiver was partitioned away at any time. The protocols are aimed either for large scale or smaller networks. We ...
متن کامل